A Process Semantics for Functional Programming
نویسندگان
چکیده
منابع مشابه
A process semantics for functional programming
The semantics of lazy functional programming languages is usually presented in two diierent ways: a semantics based on trees which is used to reason about a program; and a semantics based on graphs which is used to implement a program. The link between these semantics is often unclear. We present a process semantics for functional programming which has a number of interesting properties. Firstl...
متن کاملGraph Rewriting Semantics for Functional Programming Languages
The lambda calculus forms without any question *the* theoretical backbone of functional programming languages. For the design and implementation of the lazy functional language Concurrent Clean we have used a related computational model: Term Graph Rewriting Systems (TGRS's). This paper wraps up our main conclusions after 10 years of experience with graph rewriting semantics for functional prog...
متن کاملDenotational Semantics for Teaching Lazy Functional Programming
If you believe this document infringes copyright then please contact the KAR admin team with the take-down information provided at http://kar.kent.ac.uk/contact.html Citation for published version Chitil, Olaf (1999) Denotational Semantics for Teaching Lazy Functional Programming. In: Proceedings of the Workshop on Functional and Declarative Programming in Education, 29 September 1999, Paris, F...
متن کاملDenotational Versus Declarative Semantics for Functional Programming
Denotational semantics is the usual mathematical semantics for functional programming languages. It is higher order (H.O.) in the sense that the semantic domain D includes D ! D] as a subdomain. On the other hand, the usual declarative semantics for logic programs is rst order (F.O.) and given by the least Herbrand model. In this paper, we take a restricted kind of H.O. conditional rewriting sy...
متن کاملComputational Semantics with Functional Programming
ing from the domain of discourse, we can say that determiner interpretations (henceforth simply called determiners) pick out binary relations on sets of individuals, on arbitrary domains of discourse E. The notation is DEAB. We call A the restriction of the quantifier and B its body. If DEAB is the translation of a simple sentence consisting of a quantified noun phrase with an intransitive verb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1995
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80178-1